Exact and metaheuristic approaches for unrelated parallel machine scheduling

Abstract In this paper, we study an important real-life scheduling problem that can be formulated as unrelated parallel machine with sequence-dependent setup times, due dates, and eligibility constraints. The objective is to minimise total tardiness makespan. We adapt extend a mathematical model find optimal solutions for small instances. Additionally, propose several variants of simulated annealing solve very large-scale instances they appear in practice. utilise different search neighbourhoods additionally investigate the use innovative heuristic move selection strategies. Further, provide set well random instance generator generate large number test perform thorough evaluation proposed techniques analyse their performance. also apply our metaheuristics approach similar from literature. Experimental results show methods are able improve produced state-of-the-art approaches